A Computational Approach for the Inventory Routing Problem
نویسندگان
چکیده
Vendor managed inventory replenishment is a business practice in which vendors monitor their customers’ inventories, and decide when and how much inventory should be replenished. The inventory routing problem addresses the coordination of inventory management and transportation. It needs to be solved to design a strategy that realizes the potential savings in inventory and transportation costs brought about by vendor managed inventory replenishment. The inventory routing problem is hard, especially if a large number of customers are involved. We formulate the inventory routing problem as a Markov decision process, and propose approximation methods to find good solutions with reasonable computational effort. Computational results are presented for the direct delivery inventory routing problem.
منابع مشابه
A Two-Phase Hybrid Heuristic Method for a Multi-Depot Inventory-Routing Problem
In this study, a two phase hybrid heuristic approach was proposed to solve the multi-depot multi-vehicle inventory routing problem (MDMVIRP). Inventory routing problem (IRP) is one of the major issues in the supply chain networks that arise in the context of vendor managed systems (VMI) The MDMVIRP combines inventory management and routing decision. We are given on input a fleet of homogeneous ...
متن کاملEnhanced chromosome repairing mechanism based genetic algorithm approach for the multi-period perishable production inventory-routing problem
One of the important aspects of distribution optimization problems is simultaneously, controlling the inventory while devising the best vehicle routing, which is a famous problem, called inventory-routing problem (IRP). When the lot-sizing decisions are jointed with IRP, the problem will get more complicated called production inventory-routing problem (PIRP). To become closer to the real life p...
متن کاملBi-objectives Approach for a Multi-period Two Echelons Perishable Product Inventory-routing Problem with Production and Lateral Transshipment
In this study, a two echelons supply chain system in which a supplier is producing perishable product and distribute it to multiple customers is considered. By allowing lateral transshipment mechanism, it is also possible to deliver products to some customers in some periods in bulk, then customers using their own vehicle to transship goods between each other seeking further reduction in the ov...
متن کاملSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کاملA green transportation location-inventory-routing problem by dynamic regional pricing
Non-uniform distribution of customers in a region and variation of their maximum willingness to pay at distinct areas make regional pricing a practical method to maximize the profit of the distribution system. By subtracting the classic objective function, which minimizes operational costs from revenue function, profit maximization is aimed. A distribution network is designed by determining the...
متن کاملa swift heuristic algorithm base on data mining approach for the Periodic Vehicle Routing Problem: data mining approach
periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. This paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (PVRP). The related results of proposed algorithm are compared with the resu...
متن کامل